ABSTRACT

In this paper, we introduce algorithms to find the vertex-to-clique (or (V, ζ ))-distance d(v, C ) between a vertex v and a clique C in a graph G, (V, ζ )-eccentricity e1 (v) of a vertex v, and (V, ζ )-center Z1(G) of a graph G usingBC - representation. Moreover, the algorithms are proved for their correctness and analyzed for their time complexity.

Keywords: - clique, distance, eccentricity, radius, center, binary count.